Executable JVM model for analytical reasoning: A study
نویسندگان
چکیده
منابع مشابه
Puzzle test: A tool for non-analytical clinical reasoning assessment
Most contemporary clinical reasoning tests typically assess non-automatic thinking. Therefore, a test is needed to measure automatic reasoning or pattern recognition, which has been largely neglected in clinical reasoning tests. The Puzzle Test (PT) is dedicated to assess automatic clinical reasoning in routine situations. This test has been introduced first in 2009 by Monajemi et al in the Oly...
متن کاملpuzzle test: a tool for non-analytical clinical reasoning assessment
most contemporary clinical reasoning tests typically assess non-automatic thinking. therefore, a test is needed to measure automatic reasoning or pattern recognition, which has been largely neglected in clinical reasoning tests. the puzzle test (pt) is dedicated to assess automatic clinical reasoning in routine situations. this test has been introduced first in 2009 by monajemi et al in the oly...
متن کاملReasoning with Executable Specifications
Starting from the speci cation of a small imperative programming language, and the description of two program transformations on this language, we formally prove the correctness of these transformations. The formal speci cations are given in a single format, and can be compiled into both executable tools and collections of de nitions to reason about into a theorem prover. This work is a case st...
متن کاملReasoning with Executable Speciications
Starting from the speciication of a small imperative programming language, and the description of two program transformations on this language, we formally prove the correctness of these transformations. The formal speciications are given in a single format, and can be compiled into both executable tools and collections of deenitions to reason about into a theorem prover. This work is a case st...
متن کاملExecutable Temporal Logic for Non-Monotonic Reasoning
In this paper we view nonmonotonic reasoning as a (special kind of) process. As temporal logic is a common formalism to specify and derive properties of processes, we introduce a variant of temporal logic as a general specification language for reasoning processes. We show that it is possible to execute finite specifications in this language, which leads to executability of a large class of fin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 2005
ISSN: 0167-6423
DOI: 10.1016/j.scico.2004.07.004